The Pastry Algorithm Based on DHT
نویسندگان
چکیده
In the P2P network, how to quickly and accurately positioning of resources is a key measure of the performance. Nowadays, distributed P2P system generally adopts DHT search method, DHT-based P2P network search algorithm of P2P is a hot topic. The paper introduces the background and current research status of the DHT. Then focused on the Pastry algorithm, Finally Pastry algorithm was analyzed and some disadvantage about it was discussed.
منابع مشابه
E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
E-Chord is a Distributed Hash Table algorithm (DHT) inspired from Chord, Pastry and CAN algorithms. It meant to provide a keyword-based search in the Three-Layer Mediation Architecture. The E-Chord is deployed in the middle layer (Integration Layer) of the architecture and provides services to the higher layer (Presence Layer) and the lower layer (Homogenization Layer).
متن کاملH-Pastry: An Adaptive Multi-level Overlay Inter-Network
Overlay networks are widely used for locating and disseminating information, by means of custom routing and forwarding on top of the underlying network. Distributed Hash Table (DHT) based overlays provide flexibility coupled with good scalability and load balancing properties. However, this comes at the cost of inefficient routing, caused by the lack of adaptation to the underlying network: cur...
متن کاملCayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is commonly recognized that the primary difficulty in designing DHT is not in static DHT topologies, but in the dynamic DHT algorithm which adapts various static DHT topologies to a dynamic network at Internet. As a direct co...
متن کاملContent-Based Multicast: Comparison of Implementation Options
This paper is an attempt to quantify the performance differences for content-based multicast implemented inside the overlay routing algorithm or built on top of the simple API provided by the routing layer. We focus on overlay networks designed for peer-to-peer distributed hash table (DHT) applications where content-based multicast is most applicable. In particular we study the Content Addressa...
متن کاملMADPastry: A DHT Substrate for Practicably Sized MANETs
Because of the increasing interest in mobile ad hoc networks (MANETs) and their inherent similarities to peer-to-peer networks a large number of routing protocols based on peer-to-peer networks have recently been presented to provide distributed network applications with e cient and indirect routing for MANETs. Thomas Zahn and Jochen Schiller suggested MADPastry, an integration of a DHT substra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer and Information Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2009